The Goldstone bosons in the pairing Hamiltonian : the path integral approach
نویسندگان
چکیده
As a first step to derive the IBM from a microscopic nuclear hamil-tonian, we bosonize the pairing hamiltonian in the framework of the path integral formalism respecting both the particle number conservation and the Pauli principle. Special attention is payed to the role of the Goldstone bosons. We construct the saddle point expansion which reproduces the sector of the spectrum associated to the addition or removal of nucleon pairs.
منابع مشابه
روش انتگرال مسیر برای مدل هابارد تک نواره
We review various ways to express the partition function of the single-band Hubard model as a path integral. The emphasis is made on the derivation of the action in the integrand of the path integral and the results obtained from this approach are discussed only briefly. Since the single-band Hubbard model is a pure fermionic model on the lattice and its Hamiltonian is a polynomial in creat...
متن کاملv 1 3 0 Ju n 20 05 Bosonization of the Pairing Hamiltonian
We address the problem of the bosonization of finite fermionic systems with two different approaches. First we work in the path integral formalism, showing how a truly bosonic effective action can be derived from a generic fermionic one with a quar-tic interaction. We then apply our scheme to the pairing hamiltonian in the degenerate case proving that, in this instance, several of the features ...
متن کامل3 Path integral bosonization of the pairing
As a first approach to a derivation of the IBM from a microscopic nuclear hamiltonian, we bosonize the pairing hamiltonian in the framework of the path integral formalism respecting both the particle number conservation and the Pauli principle. We construct the saddle point expansion which reproduces the sector of the spectrum associated to the addition or removal of nucleon pairs.
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کامل